Tableau Systems for Epistemic Positional Logics
نویسندگان
چکیده
The goal of the article is twofold. first one to provide logics based on positional semantics which will be suitable for analysis epistemic modalities such as ‘agent ... knows/beliefs that ...’. second define tableau systemsfor logics. Firstly, we present minimal logic MR. Then, change notion formulas and in order consider iterations operator realization “free” classical formulas. After that, move weaker avoid well known problem logical omniscience. At same time, keep counterparts modal axioms (T), (4) (5). For all considered sound complete systems.
منابع مشابه
Synthesising and Implementing Tableau Calculi for Interrogative Epistemic Logics
This paper presents a labelled tableau approach for deciding interrogative-epistemic logics (IEL). Tableau calculi for these logics have been derived using a recently introduced tableau synthesis method. We also consider an extension of the framework for a setting with questioning modalities over sequences of formulae called sequential questioning logic (SQL). We have implemented the calculi us...
متن کاملTableau Proof Systems for Justification Logics
In this paper we present tableau proof systems for various justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. In order to prove the completeness of the tableaux, we give a syntactic proof of cut elimination. We also show the subformula property for our tableaux.
متن کاملTableau Calculi for Hybrid Logics
Hybrid logics were proposed in [15] as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as formulae. In addition, hybrid logics may contain quanti ers to bind the labels. Thus, hybrid logics have both Kripke semantics and a rst-order binding apparatus. We present pre xed tableau calculi for weak hybrid l...
متن کاملClausal Tableau Systems and Space Bounds for the Modal Logics
We propose so called clausal tableau systems for the common modal logics K , KD , T , KB , KDB and B . There is a measure such that for each tableau rule of these systems the measure of all its denominators is smaller than the measure of its numerator. Basing on these systems, we give a decision procedure for the logics, which uses O(n)-space for the logics T , KB , KDB and B , and O(n. logn)-s...
متن کاملTableau Algorithms for Description Logics
Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satissability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Section of Logic
سال: 2021
ISSN: ['2449-836X', '0138-0680']
DOI: https://doi.org/10.18778/0138-0680.2021.06